Algorithmic Problem Solving and Novel Associations
نویسندگان
چکیده
We elaborate on the essential role of novel associations between recognized task patterns and invoked algorithmic schemes, during algorithmic problem solving. We display three algorithmic tasks of different levels of difficulty, and characterize them by their required pattern-scheme associations. We display diverse student solutions to the tasks, which reflect different levels of competence; and suggest a series of considerations of which tutors should be aware upon selecting and posing algorithmic challenges to students.
منابع مشابه
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملA Novel Technique for Joint Energy and Reserve Dispatch Considering Lost Opportunity Cost
This paper presents a novel solution method for joint energy and Spinning Reserve (SR) dispatch problem. In systems in which the Lost Opportunity Cost (LOC) should be paid to generators, if the LOC is not considered in the dispatch problem, the results may differ from the truly optimum solution. Since the LOC is a non-differentiable function, including it in the formulation makes the problem so...
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملA Novel Successive Approximation Method for Solving a Class of Optimal Control Problems
This paper presents a successive approximation method (SAM) for solving a large class of optimal control problems. The proposed analytical-approximate method, successively solves the Two-Point Boundary Value Problem (TPBVP), obtained from the Pontryagin's Maximum Principle (PMP). The convergence of this method is proved and a control design algorithm with low computational complexity is present...
متن کاملPERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS
The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011